Hierarchical package bidding: A paper & pencil combinatorial auction
نویسندگان
چکیده
منابع مشابه
Hierarchical package bidding: A paper & pencil combinatorial auction
We introduce a new combinatorial auction format based on a simple, transparent pricing mechanism tailored for the hierarchical package structure proposed by Rothkopf, Pekeč, and Harstad (1998) to avoid computational complexity. This combination provides the feedback necessary for bidders in multi-round auctions to discern winning bidding strategies for subsequent rounds and to coordinate respon...
متن کاملApproximate Bidding Algorithms for a Distributed Combinatorial Auction (Short Paper)
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs) for CAs are centralized. The PAUSE auction is one of a few efforts to release the auctioneer from having to do all the work. The pausebid bidding algorithm[6] generates myopically-optimal bids for agents in a PAUSE a...
متن کاملApproximate bidding algorithms for a distributed combinatorial auction
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions (CAs). However, most of the existing winner determination algorithms (WDAs) for CAs are centralized. The PAUSE auction is one of a few efforts to release the auctioneer from having to do all the work. The pausebid bidding algorithm[6] generates myopically-optimal bids for agents in a PAUSE a...
متن کاملOn bidding algorithms for a distributed combinatorial auction
Combinatorial auctions (CAs) are a great way to solve complex resource allocation and coordination problems. However, CAs require a central auctioneer who receives the bids and solves the winner determination problem, an NP-hard problem. Unfortunately, a centralized auction is not a good fit for real world situations where the participants have proprietary interests that they wish to remain pri...
متن کاملAgents' Bidding Strategies in a Combinatorial Auction Controlled Grid Environment
We present an agent-based simulation environment for resource allocation in a distributed computer system that employs a combinatorial task scheduler. Our environment enables the simulation of a mechanism for the simultaneous allocation of resources like CPU time (CPU), communication bandwidth (NET), volatile (MEM) and non-volatile memory (DSK) in the distributed computer system. In contrast to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Games and Economic Behavior
سال: 2010
ISSN: 0899-8256
DOI: 10.1016/j.geb.2008.02.013